Reachability Under Uncertainty
نویسندگان
چکیده
In this paper we introduce a new network reachability problem where the goal is to find the most reliable path between two nodes in a network, represented as a directed acyclic graph. Individual edges within this network may fail according to certain probabilities, and these failure probabilities may depend on the values of one or more hidden variables. This problem may be viewed as a generalization of shortest-path problems for finding minimum cost paths or Viterbi-type problems for finding highest-probability sequences of states, where the addition of the hidden variables introduces correlations that are not handled by previous algorithms. We give theoretical results characterizing this problem including an NP-hardness proof. We also give an exact algorithm and a more efficient approximation algorithm for this problem.
منابع مشابه
Reachability Under Uncertainty
The paper studies the problem of reachability for linear systems in the presence of uncertain (unknown but bounded) input disturbances, which may also be interpreted as the action of an adversary in a gametheoretic setting. It defines possible notions of reachability under uncertainty emphasizing the differences between open-loop and closed-loop control. Solution schemes for calculating reachab...
متن کاملOn Reachability Under Uncertainty
The paper studies the problem of reachability for linear systems in the presence of uncertain input disturbances that may also be interpreted as the action of an adversary in a game-theoretic setting. It emphasizes the differences between reachability under open-loop and closed-loop control. The situation when observations arrive at given isolated instances of time, leads to problems of anticip...
متن کاملSCALABLE PLANNING UNDER UNCERTAINTY by
Autonomous agents that act in the real-world can often improve their success by capturing the uncertainty that arises because of their imperfect knowledge and potentially faulty actions. By making plans robust to uncertainty, agents can be prepared to counteract plan failure or act upon information that becomes available during plan execution. Such robust plans are valuable, but are often diffi...
متن کاملOn Optimal Scheduling under Uncertainty
In this work we treat the problem of scheduling under two types of temporal uncertainty, setbased and probabilistic. For the former we define appropriate optimality criteria and develop an algorithm for finding optimal scheduling strategies using a backward reachability algorithm for timed automata. For probabilistic uncertainty we define and solve a special case of continuoustime Markov Decisi...
متن کاملPlanning under uncertainty for extended reachability goals
Planning under uncertainty has being increasingly demanded for practical applications in several areas that require reliable solutions for complex goals and, therefore, some approaches for automatic plan synthesis based on formal methods have been proposed in AI Planning. Among these approaches, planning based on model checking seems to be a very attractive one, however, it is mainly based on c...
متن کاملREACHABILITY UNDER UNCERTAINTY and MEASUREMENT NOISE
This report deals with the problem of reachability under unknown but bounded disturbances and piecewise open-loop controls which may be feedback-corrected at isolated “points of correction”. It is presumed that there are hard bounds on the controls and the unknown but bounded items. The open-loop controls are reassigned at prespecified points of correction on the basis of additional information...
متن کامل